منابع مشابه
Sorting a Permutation with Block Moves
We prove a lower and an upper bound on the number of block moves necessary to sort a permutation. We put our results in contrast with existing results on sorting by block transpositions, and raise some open questions.
متن کاملRevisiting bounded context block-sorting transformations
The Burrows-Wheeler Transform (bwt) produces a permutation of a string X, denoted X∗, by sorting the n cyclic rotations of X into full lexicographical order, and taking the last column of the resulting n× n matrix to be X∗. The transformation is reversible in O(n) time. In this paper, we consider an alteration to the process, called k-bwt, where rotations are only sorted to a depth k. We propos...
متن کاملIn-Place Sorting with Fewer Moves
It is shown that an array of n elements can be sorted using O(1) extra space, O(n log n= log log n) element moves, and n log 2 n+O(n log log n) comparisons. This is the rst in-place sorting algorithm requiring o(n log n) moves in the worst case while guaranteeing O(n log n) comparisons, but due to the constant factors involved the algorithm is predominantly of theoretical interest.
متن کاملBlock Sorting and Compression
The Block Sorting Lossless Data Compression Algorithm (BSLDCA) described by Burrows and Wheeler 3] has received considerable attention. It achieves as good compression rates as context-based methods, such as PPM, but at execution speeds closer to Ziv-Lempel techniques 5]. This paper, describes the Lexical Permutation Sorting Algorithm (LPSA), its theoretical basis, and delineates its relationsh...
متن کاملPractical block sequence alignment with moves
In this paper we study a sequence alignment problem motivated by textual genetic criticism, a humanities discipline where the notion of edit distance with moves has been rediscovered by philologists. We present a formulation of the problem and show that the usual notion of edit distance with moves does not address it correctly because it is harder. We present a heuristic algorithm for this prob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1998
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(98)00072-9